Admission control with batch arrivals
نویسندگان
چکیده
We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate μ, and brings a reward ri. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.
منابع مشابه
A discrete - time Geo [ X ] / G / 1 retrial queue with control of admission
This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis on the computation of its steady-state distribution. To this end we employ numerical inversion and maximum entropy techniques. We also establish a...
متن کاملDynamic Admission Control for Loss Systems with Batch Arrivals
We consider the problem of dynamic admission control in a Markovian loss system with two classes. Jobs arrive at the system in batches, where each admitted job requires different service rates and brings different revenues depending on its class. We introduce the definition of “preferred class” for systems receiving mixed and one-class batches separately, and derive sufficient conditions for ea...
متن کاملAdmission control and pricing in a queue with batch arrivals
We investigate a problem of admission control and pricing in a firm which dominates the market. In the model, there is a single server with exponential service times and arrivals follow a compound Poisson process where the number of customers in a group is an arbitrary discrete random variable. Each arriving group calculates the expected return for the whole group using the waiting cost per uni...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملSteady State Analysis of Batch Arrival M/G/1 Retrial Queuing Model with State Dependent Admission, Modified Vacation and Feedback
Abstract. A batch arrival retrial queue with general retrial times, state dependent admission, modified vacation policy and feed back is analysed in this paper. Arrivals are controlled according to the state of the server. If the orbit is empty, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from the vacation. At the service com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 32 شماره
صفحات -
تاریخ انتشار 2004